Diagonals of convex sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inner diagonals of convex polytopes

An inner diagonal of a polytope P is a segment that joins two vertices of P and that lies, except for its ends, in P ’s relative interior. For 1 ≤ i ≤ d, an i-diagonal of a d-polytope P is a segment [x, y] whose ends are vertices of P and whose carrier in P (i.e., the smallest face of P that contains [x, y]) is of dimension i. The number of P ’s i-diagonals is denoted by δi(P ). Thus δ1(P ) is ...

متن کامل

Convex Sets and Convex Combinations

Convexity is one of the most important concepts in a study of analysis. Especially, it has been applied around the optimization problem widely. Our purpose is to define the concept of convexity of a set on Mizar, and to develop the generalities of convex analysis. The construction of this article is as follows: Convexity of the set is defined in the section 1. The section 2 gives the definition...

متن کامل

Convex Sets and Convex Functions

In this section, we introduce one of the most important ideas in economic modelling, in the theory of optimization and, indeed in much of modern analysis and computatyional mathematics: that of a convex set. Almost every situation we will meet will depend on this geometric idea. As an independent idea, the notion of convexity appeared at the end of the 19 century, particularly in the works of M...

متن کامل

Convex Sets

Javier Alonso*, Pedro Mart́ın. Universidad de Extremadura, Badajoz, Spain. Characterizations of ellipsoids by sections. Let S be the boundary of a convex body in the d-dimensional Euclidean space E (d ≥ 3). It is well known that S is an ellipsoid if and only if the section of S given by any hyperplane is ellipsoidal. The question of whether it is actually necessary to consider “any” hyperplane t...

متن کامل

States of Convex Sets

State spaces in probabilistic and quantum computation are convex sets, that is, Eilenberg–Moore algebras of the distribution monad. This article studies some computationally relevant properties of convex sets. We introduce the term effectus for a base category with suitable coproducts (so that predicates, as arrows of the shape X → 1 + 1, form effect modules, and states, as arrows of the shape ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1978

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1978.101511